Dichromatic polynomials and Potts models summed over rooted maps
نویسنده
چکیده
We consider the sum of dichromatic polynomials over non-separable rooted planar maps, an interesting special case of which is the enumeration of such maps. We present some known results and derive new ones. The general problem is equivalent to the q-state Potts model randomized over such maps. Like the regular ferromagnetic lattice models, it has a first-order transition when q is greater than a critical value qc, but qc is much larger about 72 instead of 4.
منابع مشابه
New Correlation Duality Relations for the Planar Potts Model
We introduce a new method to generate duality relations for correlation functions of the Potts model on a planar graph. The method extends previously known results, by allowing the consideration of the correlation function for arbitrarily placed vertices on the graph. We show that generally it is linear combinations of correlation functions, not the individual correlations, that are related by ...
متن کاملChromatic Roots are Dense in the Whole Complex Plane
I show that the zeros of the chromatic polynomials PG(q) for the generalized theta graphs Θ(s,p) are, taken together, dense in the whole complex plane with the possible exception of the disc |q − 1| < 1. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) ZG(q, v) outside the disc |q + v| < |v|. An immediate corollary is that the chr...
متن کاملPolynomial Tutte Invariants of Rooted Integral Gain Graphs
We present dichromatic and tree-expansion polynomials of integral gain graphs that underlie the problem of counting lattice points in the complement of an integral affinographic hyperplane arrangement. This is a step towards finding the universal Tutte invariant of rooted integral gain graphs. Mathematics Subject Classifications (2000): Primary 05C22; Secondary 05C15.
متن کاملOn Dichromatic Polynomials
A study is made of the combinatorial properties of the dichromatic polynomials of graphs, especially those properties theoretically applicable to the recursive calculation of the polynomials. The dichromatic polynomials of the complete graphs are determined and a contribution is made to the theory of chromatic roots.
متن کاملTotally frustrated states in the chromatic theory of gain graphs
We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of ‘qualities’ or ‘spins’ that is permuted by the gain group. In standard coloring the group acts trivially or regularly on each orbit (an example is the Potts model), but in the generalization the action is unrestricted. We show that the number of totally frustrated states satisf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008